Changing the circuit-depth complexity of measurement-based quantum computation with hypergraph states
نویسندگان
چکیده
منابع مشابه
Computational Depth Complexity of Measurement-Based Quantum Computation
We prove that one-way quantum computations have the same computational power as quantum circuits with unbounded fan-out. It demonstrates that the one-way model is not only one of the most promising models of physical realisation, but also a very powerful model of quantum computation. It confirms and completes previous results which have pointed out, for some specific problems, a depth separatio...
متن کاملMeasurement-based quantum computation on cluster states
We give a detailed account of the one-way quantum computer, a scheme of quantum computation that consists entirely of one-qubit measurements on a particular class of entangled states, the cluster states. We prove its universality, describe why its underlying computational model is different from the network model of quantum computation and relate quantum algorithms to mathematical graphs. Furth...
متن کاملEmulating Circuit-Based and Measurement-Based Quantum Computation
This thesis presents classical emulations of circuit-based and measurement-based quantum com-putation. In order to create emulators faithful to the theory of quantum computation we developthe required mathematics, quantum mechanics and quantum computing background. We justifyour implementations by documenting the theory of each of these subjects in detail and showing ourimpl...
متن کاملSymmetry protection of measurement-based quantum computation in ground states
The two-dimensional cluster state, a universal resource for measurement-based quantum computation, is also the gapped ground state of a short-ranged Hamiltonian. Here, we examine the effect of perturbations to this Hamiltonian. We prove that, provided the perturbation is sufficiently small and respects a certain symmetry, the perturbed ground state remains a universal resource. We do this by ch...
متن کاملQuantum hypergraph states
We introduce a class of multiqubit quantum states which generalizes graph states. These states correspond to an underlying mathematical hypergraph, i.e. a graph where edges connecting more than two vertices are considered. We derive a generalized stabilizer formalism to describe this class of states. We introduce the notion of k-uniformity and show that this gives rise to classes of states whic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2019
ISSN: 2469-9926,2469-9934
DOI: 10.1103/physreva.99.052304